Probabilistic Model Checking for Propositional Projection Temporal Logic

نویسنده

  • Xiaoxiao Yang
چکیده

Propositional Projection Temporal Logic (PPTL) is a useful formalism for reasoning about period of time in hardware and software systems and can handle both sequential and parallel compositions. In this paper, based on discrete time Markov chains, we investigate the probabilistic model checking approach for PPTL towards verifying arbitrary linear-time properties. We first define a normal form graph, denoted by NFG inf , to capture the infinite paths of PPTL formulas. Then we present an algorithm to generate the NFG inf . Since discrete-time Markov chains are the deterministic probabilistic models, we further give an algorithm to determinize and minimize the nondeterministic NFG inf following the Safra’s construction.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic Model Checking on Propositional Projection Temporal Logic

Propositional Projection Temporal Logic (PPTL) is a useful formalism for reasoning about period of time in hardware and software systems and can handle both sequential and parallel compositions. In this paper, based on discrete time Markov chains, we investigate the probabilistic model checking approach for PPTL towards verifying arbitrary linear-time properties. We first define a normal form g...

متن کامل

Temporalization of Probabilistic Propositional Logic

In this paper we study several properties of the Exogenous Probabilistic Propositional Logic (EPPL), a logic for reasoning about probabilities, with the purpose of introducing a temporal version Exogenous Probabilistic Linear Temporal Logic (EPLTL). In detail, we give a small model theorem for EPPL and introduce a satisfaction and a model checking algorithm for both EPPL and EPLTL. We are also ...

متن کامل

A Probabilistic Variant of Projection Temporal Logic

In this paper, we propose Probabilistic discrete-time Projection Temporal Logic (PrPTL), which extends Projection Temporal Logic (PTL) with probability. To this end, some useful formulas are derived and some logic laws are given. Further, we define Time Normal Form (TNF) for PrPTL as the standard form and prove that any PrPTL formulas can be rewritten to TNF. According to the TNF, we construct ...

متن کامل

Compositional Verification with Stutter-invariant Propositional Projection Temporal Logic

This paper investigates compositional verification with Propositional Projection Temporal Logic (PPTL). To this end, a sublogic Stutter-invariant PPTL (written as PPTLst) is first proposed. As a specification language, PPTLst helps designers get rid of irrelevant detail in compositional verification of a concurrent system since the projection construct of PPTLst allows designers to assert formu...

متن کامل

Exogenous Probabilistic Computation Tree Logic

We define a logic EpCTL for reasoning about the evolution of probabilistic systems. System states correspond to probability distributions over classical states and the system evolution is modelled by probabilistic Kripke structures that capture both stochastic and non–deterministic transitions. The proposed logic is a temporal enrichment of Exogenous Probabilistic Propositional Logic (EPPL). Th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1011.1321  شماره 

صفحات  -

تاریخ انتشار 2010